Combining Decision Procedures in the HOL System
نویسنده
چکیده
A HOL implementation of Nelson and Oppen's technique for combining decision procedures is described. The principal advantage of this technique is that the procedures for the component theories (e.g. linear arithmetic, lists, uninterpreted function symbols) remain separate. Equations between two variables are the only information that need be communicated between them. Thus, code for deciding the component theories can be reused in a combined procedure and the latter can easily be extended. In addition, eeciency techniques used in the component procedures can be retained in the combined procedure.
منابع مشابه
Complete Integer Decision Procedures as Derived Rules in HOL
I describe the implementation of two complete decision procedures for integer Presburger arithmetic in the HOL theorem-proving system. The first procedure is Cooper’s algorithm, the second, the Omega Test. Between them, the algorithms illustrate three different implementation techniques in a fully expansive system.
متن کاملCombining WS1S and HOL
We investigate the combination of the weak second-order monadic logic of one successor (WS1S) with higher-order logic (HOL). We show how these two logics can be combined, how theorem provers based on them can be safely integrated, and how the result can be used. In particular, we present an embedding of the semantics of WS1S in HOL that provides a basis for coupling the MONA system, a decision ...
متن کاملLearning to Reason with HOL4 tactics
Techniques combining machine learning with translation to automated reasoning have recently become an important component of formal proof assistants. Such “hammer” techniques complement traditional proof assistant automation as implemented by tactics and decision procedures. In this paper we present a unified proof assistant automation approach which attempts to automate the selection of approp...
متن کاملModular data structure verification
This dissertation describes an approach for automatically verifying data structures, focusing on techniques for automatically proving formulas that arise in such verification. I have implemented this approach with my colleagues in a verification system called Jahob. Jahob verifies properties of Java programs with dynamically allocated data structures. Developers write Jahob specifications in cl...
متن کاملMultiway Decision Graphs Reduction Approach based on the HOL Theorem Prover
Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) by representing formulae which are suitable for first-order model checking able to handle large datapath circuits. In this paper, we propose a reduction approach to improve MDGs model checking. We use a reduction platform based on combining MDGs with the rewriting engine of the HOL theorem prover. The idea is to prune the t...
متن کامل